Finite Bu er Realization of Input - Output

Many discrete event systems (DESs) such as manufacturing systems, data base management systems, communication networks, tra c systems, etc., can be modeled as input-output discrete event systems (I/O DESs). In this paper we formulate and study the problem of stable realization of such systems in the logical setting. Given an input and an output language describing the sequences of events that occur at the input and the output, respectively, of an I/O DES, we study whether it is possible to realize the system as a unit consisting of a given set of bu ers of nite capacity, called a dispatching unit. The notions of stable, conditionally stable, dispatchable and conditionally dispatchable units are introduced as existence of stable (or input-output bounded), and causal (or pre x preserving) input-output maps, and e ectively computable necessary and su cient conditions for testing them are obtained.